Orthogonality of matrices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orthogonality of matrices

Let A and B be rectangular matrices. Then A is orthogonal to B if II A + f-LB II ?: II A II for every scalar f-L. Some approximation theory and convexity results on matrices are used to study orthogonality of matrices and answer an open problem of Bhatia and Semrl. © 2002 Elsevier Science Inc. All rights reserved.

متن کامل

Orthogonality Matrices for Modulesover Finite Frobenius RingsandMacWilliams’ EquivalenceTheorem

MacWilliams’ equivalence theorem states that Hamming isometries between linear codes extend to monomial transformations of the ambient space. One of the most elegant proofs for this result is due to K. P. Bogart et al. (1978, Inform. and Control 37, 19–22) where the invertibility of orthogonality matrices of finite vector spaces is the key step. The present paper revisits this technique in orde...

متن کامل

A characterization of orthogonality preserving operators

‎In this paper‎, ‎we characterize the class of orthogonality preserving operators on an infinite-dimensional Hilbert space $H$ as scalar multiples of unitary operators between $H$ and some closed subspaces of $H$‎. ‎We show that any circle (centered at the origin) is the spectrum of an orthogonality preserving operator‎. ‎Also‎, ‎we prove that every compact normal operator is a strongly orthogo...

متن کامل

Global Orthogonality Implies Local Almost-orthogonality

We introduce a new stopping-time argument, adapted to handle linear sums of noncompactly-supported functions that satisfy fairly weak decay, smoothness, and cancellation conditions. We use the argument to obtain a new Littlewood-Paley-type result for such sums. 0. Introduction. First, an apology. The title, though correct, is somewhat misleading. It should be “Global almostorthogonality implies...

متن کامل

Sums of random symmetric matrices and quadratic optimization under orthogonality constraints

Let Bi be deterministic real symmetric m × m matrices, and ξi be independent random scalars with zero mean and “of order of one” (e.g., ξi ∼ N (0, 1)). We are interested to know under what conditions “typical norm” of the random matrix SN = N ∑ i=1 ξiBi is of order of 1. An evident necessary condition is E{S2 N} 1 O(1)I, which, essentially, translates to N ∑ i=1 B i 1 I; a natural conjecture is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2002

ISSN: 0024-3795

DOI: 10.1016/s0024-3795(01)00530-4